Exponential concentration of cover times
نویسنده
چکیده
We prove an exponential concentration bound for cover times of general graphs in terms of the Gaussian free field, extending the work of Ding, Lee, and Peres [8] and Ding [7]. The estimate is asymptotically sharp as the ratio of hitting time to cover time goes to zero. The bounds are obtained by showing a stochastic domination in the generalized second Ray-Knight theorem, which was shown to imply exponential concentration of cover times by Ding in [7]. This stochastic domination result appeared earlier in a preprint of Lupu [22], but the connection to cover times was not mentioned.
منابع مشابه
تأثیر مدیریت کاربرد کود سبز و تیمارهای کود دهی آن بر خصوصیات فیزیکی- شیمیایی و حاصلخیزی خاک
Cover crops, conservation tillage systems and organic fertilizers have played an important role in maintaining or enhancing soil quality. In order to assess the combined effects of these techniques on soil quality an experiment was conducted as split Plot experiment based on randomized complete block design with three replications at Shahid Bahonar University of Kerman in 2011-2012. &nbs...
متن کاملA Random Walk with Exponential Travel Times
Consider the random walk among N places with N(N - 1)/2 transports. We attach an exponential random variable Xij to each transport between places Pi and Pj and take these random variables mutually independent. If transports are possible or impossible independently with probability p and 1-p, respectively, then we give a lower bound for the distribution function of the smallest path at point log...
متن کاملOpen Problem: Analyzing Ant Robot Coverage
Ant robots can repeatedly and robustly cover terrain by always moving away from the trails that they leave in the terrain. This coverage strategy can be modeled with graph traversal strategies similar to real-time search methods (such as Learning Real-Time A*) and reinforcement learning methods (such as Real-Time Dynamic Programming). The resulting worst-case cover times are known to be exponen...
متن کاملEfficient Algorithms for the max k -vertex cover Problem
We first devise moderately exponential exact algorithms for max k-vertex cover, with time-complexity exponential in n but with polynomial space-complexity by developing a branch and reduce method based upon the measure-and-conquer technique. We then prove that, there exists an exact algorithm for max k-vertex cover with complexity bounded above by the maximum among c and γ , for some γ < 2, whe...
متن کاملPrediction of Times to Failure of Censored Units in Hybrid Censored Samples from Exponential Distribution
In this paper, we discuss different predictors of times to failure of units censored in a hybrid censored sample from exponential distribution. Bayesian and non-Bayesian point predictors for the times to failure of units are obtained. Non-Bayesian prediction Intervals are obtained based on pivotal and highest conditional density methods. Bayesian prediction intervals are also proposed. One real...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014